Regular affine tilings and regular maps on a flat torus

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular cyclic coverings of regular affine maps

The regular coverings of regular affine algebraic maps are considered, and a large family of totally ramified coverings—the so-called Steinberg and Accola coverings—are fully classified.

متن کامل

Regular Surfaces and Regular Maps

A regular surface is a closed genus g surface defined as the tubular neighbourhood of the edge graph of a regular map. A regular map is a family of disc type polygons glued together to form a 2-manifold which is flag transitive. The visualization of this highly symmetric surface is an intriguing and challenging problem. Unlike regular maps, regular surfaces can always be visualized as 3D embedd...

متن کامل

Regular Homomorphisms and Regular Maps

Regular homomorphisms of oriented maps essentially arise from a factorization by a subgroup of automorphisms. This kind of map homomorphism is studied in detail, and generalized to the case when the induced homomorphism of the underlying graphs is not valency preserving. Reconstruction is treated by means of voltage assignments on angles, a natural extension of the common assignments on darts. ...

متن کامل

Combinatorially Regular Polyomino Tilings

Let T be a regular tiling of R which has the origin 0 as a vertex, and suppose that φ : R → R is a homeomorphism such that i) φ(0) = 0, ii) the image under φ of each tile of T is a union of tiles of T , and iii) the images under φ of any two tiles of T are equivalent by an orientation-preserving isometry which takes vertices to vertices. It is proved here that there is a subset Λ of the vertice...

متن کامل

Complexity of cutting words on regular tilings

We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct factors of length n in the infinite word u and where the boundary of Q is constructed by 2p horizontal and 2q vertical unit segments.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2000

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(00)00174-8